Assumption–Commitment Support for CSP Model Checking

Model checking Timed CSP

Though Timed CSP was developed 25 years ago and the CSP-based refinement checker FDR [25] was first released 20 years ago, there has never been a version of this tool for Timed CSP. In this paper we report on the creation of such a version, based on the digitisation results of Ouaknine [16, 17] and the associated development of discrete-time versions of Timed CSP with associated models [19, 14,...

Model-Checking CSP-Z

Model-checking is now widely recognised as an eecient method for analysing computer system properties, such as deadlock-freedom. Its practical applicability is due to existing automatic tools which deal with tedious proofs. Another increasingly research area is formal language integration where the capabilities of each language are used to capture precisely some aspects of a system. In this pap...

Model-checking CSP-Z: strategy, tool support and industrial application

Model Checking of Control-Finite CSP Programs

We investigate an automatic verification mechanism for control-finite CSP programs using the model checking technique. CSP programs with variables and usual sequential constructs are transformed into transition systems to apply the model checking technique. More specifically, binding of variables are attached to states and sequential statements are treated uniformly as events in a parallel envi...

Model-Checking CSP-OZ Specifications with FDR

CSP-OZ is a formal method integrating two diierent speciications formalisms into one: the formalism Object-Z for the description of static aspects, and the process algebra CSP for the description of the dynamic behaviour of systems. The semantics of CSP-OZ is failure divergence taken from the process algebra side. In this paper we propose a method for checking correctness of CSP-OZ speciication...